Online (J,K)-search problem and its competitive analysis

Online (J, K)-search problem and its competitive analysis

Article history: Received 5 April 2015 Received in revised form 30 May 2015 Accepted 2 June 2015 Available online 9 June 2015 Communicated by D.-Z. Du

A Simple and General Problem and its Optimal Randomized Online Algorithm Design with Competitive Analysis

The online algorithm design was proposed to handle the caching problem when the future information is unknown [3]. And currently, it draws more and more attentions from the researchers from the areas of microgrid, where the production of renewables are unpredictable, [5], [4], etc. In this note, we present a framework of randomized online algorithm design for the simple and tractable problem. T...

Competitive Analysis for Online Leasing Problem with Compound Interest Rate

and Applied Analysis 3 defined the same as 1.1 with Coston I;A replaced by E Coston I;A , which is the expected value of A’s cost on input I. The online leasing problem has been investigated by many authors 13–15 . For the continuous version, the optimal deterministic and randomized competitive ratios are 2 and e/ e − 1 ≈ 1.582, respectively 2, 3 . When considering alternative financial decisio...

Online computation and competitive analysis

Online Financial Algorithms Competitive Analysis

Analysis of algorithms with complete knowledge of its inputs is sometimes not up to our expectations. Many times we are surrounded with such scenarios where inputs are generated without any prior knowledge. Online Algorithms have found their applicability in broad areas of computer engineering. Among these, an online financial algorithm is one of the most important areas where lots of efforts h...